#include "sorter.h"
#include "heap.h"

// Returning the array of sorted edges is not strictly necessary since the array
// that is passed in is going to be sorted and also accessible outside the function,
// however this is bad practice as it means external functions will rely on the
// internal implementation here not "breaking" the edgeArray in any way (this is
// one reason why simulating return values with pointer arguments is a bad idea)
void Sorter::sort(vector<Edge> &v)
{	
	s->sort(v);
}

void Sorter::setStrategy(SortStrategy *s)
{
	this->s = s;
}
